Counter-examples in parametric geometry of numbers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof-Like Counter-Examples

Counter-examples explain why a desired temporal logic property fails to hold, and as such considered to be the most useful form of output from modelcheckers. Reported explanations are typically short and described in terms of states and transitions of the model; as a result, they can be effectively used for debugging. However, counter-examples are not available for every CTL property and are of...

متن کامل

Reachability in Parametric Counter Automata

Counter automata are a fundamental class of infinite-state systems. They consist of a finite set of control locations, transitions between them and a finite set of counters over the positive integers. At each transition, a counter can be tested for zero or incremented by some

متن کامل

Flat Parametric Counter Automata

In this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter automata and Presburger arithmetic has been established previously by Comon and Jurski [5]. We simplify their proof by introducing finite state automata defined over alphabe...

متن کامل

Application of parametric form for ranking of fuzzy numbers

In this paper, we propose a new approach for ranking all fuzzynumbers based on revising the ranking method proposed by Ezzati et al. cite{Ezzati}.To this end, we present and investigate some properties of the proposed approach indetails. Finally, to illustrate the advantage of the proposed method, it is applied to several groups of fuzzy numbers and the results are compared with other related a...

متن کامل

Finding Counter Examples in Induction Proofs

This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2020

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa191217-9-4